The weighted independent domination problem is NP-complete for chordal graphs
نویسنده
چکیده
The concept of domination in graph theory is a natural model for many location problems in operations research. In a graph G = (V, E), a dominating set is a subset D of V such that every vertex not in D is adjacent to at least one vertex in D. The domination problem is to determine, for a graph G and a positive integer k, if G has a dominating set of size at most k. Domination and its variations have been extensively studied in the literature (see [1, 4, 5]).
منابع مشابه
More results on weighted independent domination
Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. In particular, the problem is NP-hard in the classes of sat-graphs and chordal graphs. We strengthen these results by showing that the problem is NP-hard in a proper subclass of the intersection of sat-graphs and chordal graphs. On the other hand, we identify ...
متن کاملOn Efficient Domination for Some Classes of H-Free Chordal Graphs
A vertex set D in a finite undirected graph G is an efficient dominating set (e.d.s. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s. in G, is known to be NP-complete even for very restricted graph classes such as for 2P3-free chordal graphs while it is solvable in polynomial time for P...
متن کاملSome Algorithmic Results on Restrained Domination in Graphs
A set D ⊆ V of a graph G = (V,E) is called a restrained dominating set of G if every vertex not in D is adjacent to a vertex in D and to a vertex in V \D. The MINIMUM RESTRAINED DOMINATION problem is to find a restrained dominating set of minimum cardinality. Given a graph G, and a positive integer k, the RESTRAINED DOMINATION DECISION problem is to decide whether G has a restrained dominating ...
متن کاملRemarks on the Complexity of Non-negative Signed Domination
This paper is motivated by the concept of nonnegative signed domination that was introduced by Huang, Li, and Feng in 2013 [15]. We study the non-negative signed domination problem from the theoretical point of view. For networks modeled by strongly chordal graphs and distance-hereditary graphs, we show that the non-negative signed domination problem can be solved in polynomial time. For networ...
متن کاملRemarks on the Complexity of Signed k-Domination on Graphs
This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We...
متن کاملWeighted efficient domination problem on some perfect graphs
Given a simple graph G = (V; E), a vertex v ∈ V is said to dominate itself and all vertices adjacent to it. A subset D of V is called an e cient dominating set of G if every vertex in V is dominated by exactly one vertex in D. The e cient domination problem is to 3nd an e cient dominating set of G with minimum cardinality. Suppose that each vertex v ∈ V is associated with a weight. Then, the we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 143 شماره
صفحات -
تاریخ انتشار 2004